-
1 sparse polynomial
Большой англо-русский и русско-английский словарь > sparse polynomial
-
2 sparse polynomial
Математика: разрежённый многочлен -
3 sparse polynomial
-
4 sparse polynomial
разреженный полином (полином, в котором число ненулевых коэффициентов много меньше его степени)Англо-русский словарь промышленной и научной лексики > sparse polynomial
-
5 polynomial
многочлен, полином || многочленный, полиномиальный- annulator polynomial - interpolation polynomial - polynomial of least deviation - polynomial of real numbersfirst-degree polynomial in f(x) — многочлен первой степени относительно функции f(x) и ее производных
-
6 разреженный многочлен
sparse polynomial мат.Русско-английский научно-технический словарь Масловского > разреженный многочлен
-
7 разреженный многочлен
Большой англо-русский и русско-английский словарь > разреженный многочлен
-
8 разрежённый многочлен
Mathematics: sparse polynomialУниверсальный русско-английский словарь > разрежённый многочлен
-
9 problem
1) проблема; задача2) проблемный3) вчт прикладной ( о программе или программисте)•- AI-complete problem
- artificial intelligence complete problem
- assignment problem
- backup problem
- benchmark problem
- bottleneck problem
- Cauchy problem
- check problem
- collision domain problem
- complementary nondeterministic polynomial time problem
- computational problem
- CoNP problem
- credit assignment problem
- decision problem
- design problem
- dimensionality problem
- domino problem
- dual problem
- eigenvalue problem
- eigenvalue assignment problem
- eight queens problem
- EVA problem
- exclusive OR problem
- feasible problem
- formalized problem
- halting problem
- identification problem
- ill-conditioned problem
- incorrectly structured problem
- key distribution problem
- Königsberg bridge problem
- last mile problem
- maximal clique problem
- multiple comparisons problem
- multi-sample problem
- nondeterministic polynomial time problem
- nondeterministic polynomial time complete problem
- nondeterministic polynomial time hard problem
- NP problem
- NPC problem
- NPH problem
- NUXI problem
- one-sample problem
- P-problem
- polynomial time problem
- Post problem
- Post correspondence problem
- Riemann-Hilbert problem
- roller-coaster problem
- satisfiability problem
- scale-up problem
- semi-structured problem
- SIEB problem
- slow-path problem
- sparse problem
- steadily injected electron beam problem
- Steiner problem on graphs
- structured problem
- test problem
- transcomputational problem
- traveling salesman problem
- trouble-location problem
- unformalized problem
- unstructured problem
- variational problem
- Y2K problem
- year 2000 problem -
10 problem
1) проблема; задача2) проблемный3) вчт. прикладной ( о программе или программисте)•- artificial intelligence complete problem
- assignment problem
- backup problem
- benchmark problem
- bottleneck problem
- Cauchy problem
- check problem
- collision domain problem
- complementary nondeterministic polynomial time problem
- computational problem
- CoNP problem
- credit assignment problem
- decision problem
- design problem
- dimensionality problem
- domino problem
- dual problem
- eigenvalue assignment problem
- eigenvalue problem
- eight queens problem
- EVA problem
- exclusive OR problem
- feasible problem
- formalized problem
- halting problem
- identification problem
- ill-conditioned problem
- incorrectly structured problem
- key distribution problem
- Königsberg bridge problem
- last mile problem
- maximal clique problem
- multiple comparisons problem
- multi-sample problem
- nondeterministic polynomial time complete problem
- nondeterministic polynomial time hard problem
- nondeterministic polynomial time problem
- NP problem
- NPC problem
- NPH problem
- NUXI problem
- one-sample problem
- P problem
- polynomial time problem
- Post correspondence problem
- Post problem
- problem of allocation
- Riemann-Hilbert problem
- roller-coaster problem
- satisfiability problem
- scale-up problem
- semi-structured problem
- SIEB problem
- slow-path problem
- sparse problem
- steadily injected electron beam problem
- Steiner problem on graphs
- structured problem
- test problem
- transcomputational problem
- traveling salesman problem
- trouble-location problem
- unformalized problem
- unstructured problem
- variational problem
- Y2K problem
- year 2000 problemThe New English-Russian Dictionary of Radio-electronics > problem
-
11 interpolation
- digital signal interpolation
- digital speech interpolation
- motion-adaptive frame interpolation
- nearest-neighbor interpolation
- nonlinear interpolation
- one-sided interpolation
- polynomial interpolation
- signal interpolation
- slice interpolation
- sparse interpolation
- speech interpolation
- straight-line interpolation
- time-assignment speech interpolation -
12 matrix
1) матрица || матричный2) кодирующая матрица; декодирующая матрица3) кодер системы цветного телевидения; декодер системы цветного телевидения•- matrix of strategies
- matrix of weighted connections
- access matrix
- active matrix
- adjacency matrix
- adjacency matrix of labeled graph
- admittance matrix
- assignment matrix
- asymptotic covariance matrix
- asymptotic information matrix
- augmented admittance matrix
- authorization matrix
- band matrix
- beam-forming matrix
- bistochastic matrix
- block matrix
- block-diagonal matrix
- Butler matrix
- character matrix
- ciphertext matrix
- circulant matrix
- clique matrix
- clique-incidence matrix
- coder matrix
- color matrix
- conductance matrix
- conjugate matrix
- connectivity matrix
- constraint matrix
- core-diode matrix
- correlation matrix
- covariance matrix
- decision matrix
- decoding matrix
- design matrix
- diagonal matrix
- diode matrix
- disperse matrix
- dispersion matrix
- distance matrix
- dot matrix
- doubly stochastic matrix
- dual-scanned passive matrix
- electronically addressed matrix
- encoder matrix
- estimator matrix
- generating matrix
- generator matrix
- geometrically addressed matrix
- gray-level co-occurrence matrix
- H-matrix
- Hadamard matrix
- Hermitian matrix
- Hessian matrix
- hologram matrix
- idempotent matrix
- identity matrix
- immittance matrix
- impact matrix
- impedance matrix
- incidence matrix
- information matrix
- instrumental variables matrix
- inverse matrix
- invertible matrix
- Jacobian matrix
- key matrix
- learning matrix
- loop-impedance matrix
- memory matrix
- microwave switching matrix
- multiple-beam-forming matrix
- n-diagonal matrix
- negative definite matrix
- negative semidefinite matrix
- nonsingular matrix
- null matrix
- orthogonal matrix
- orthonormal matrix
- outcome matrix
- parity-check matrix
- partitioned matrix
- passive matrix
- permeabilitymatrix
- permittivity matrix
- permutation matrix
- polarization matrix
- polarization scattering matrix
- polynomial matrix
- positive definite matrix
- positive semidefinite matrix
- power scattering matrix
- projection matrix
- pseudoinverse matrix
- radar cross-section matrix
- radar scattering matrix
- reciprocal matrix
- rectangular matrix
- reflecting matrix
- regression matrix
- resistivity matrix
- resolvent matrix
- scattering matrix
- scattering matrix with absolute phase
- scattering matrix with relative phase
- scrambling matrix
- selection matrix
- shift matrix
- signal matrix
- singular matrix
- sparse matrix
- spectral matrix
- spurless matrix
- square matrix
- state matrix
- stochastic matrix
- storage matrix
- switching matrix
- symmetric matrix
- symmetry matrix
- systolic matrix
- target-scattering matrix
- thermally-addressed matrix
- thinned matrix
- topological matrix
- traceless matrix
- traffic matrix
- traffic requirement matrix
- transformation matrix
- transformer-diode matrix
- transition matrix
- transition probability matrix
- transmission matrix
- transposed matrix
- triangular matrix
- two-dimensional matrix
- U-matrix
- unit matrix
- unitary matrix
- variance-covariance matrix
- weight matrix
- x-y matrix
- Y-matrix
- Z-matrix -
13 interpolation
- digital signal interpolation
- digital speech interpolation
- motion-adaptive frame interpolation
- nearest-neighbor interpolation
- nonlinear interpolation
- one-sided interpolation
- polynomial interpolation
- signal interpolation
- slice interpolation
- sparse interpolation
- speech interpolation
- straight-line interpolation
- time-assignment speech interpolationThe New English-Russian Dictionary of Radio-electronics > interpolation
-
14 matrix
1) матрица || матричный2) кодирующая матрица; декодирующая матрица3) кодер системы цветного телевидения; декодер системы цветного телевидения•- active matrix
- adjacency matrix of labeled graph
- adjacency matrix
- admittance matrix
- assignment matrix
- asymptotic covariance matrix
- asymptotic information matrix
- augmented admittance matrix
- authorization matrix
- band matrix
- beam-forming matrix
- bistochastic matrix
- block matrix
- block-diagonal matrix
- Butler matrix
- character matrix
- ciphertext matrix
- circulant matrix
- clique matrix
- clique-incidence matrix
- coder matrix
- color matrix
- conductance matrix
- conjugate matrix
- connectivity matrix
- constraint matrix
- core-diode matrix
- correlation matrix
- covariance matrix
- decision matrix
- decoding matrix
- design matrix
- diagonal matrix
- diode matrix
- disperse matrix
- dispersion matrix
- distance matrix
- dot matrix
- doubly stochastic matrix
- dual-scanned passive matrix
- electronically addressed matrix
- encoder matrix
- estimator matrix
- generating matrix
- generator matrix
- geometrically addressed matrix
- gray-level co-occurrence matrix
- H matrix
- Hadamard matrix
- Hermitian matrix
- Hessian matrix
- hologram matrix
- idempotent matrix
- identity matrix
- immittance matrix
- impact matrix
- impedance matrix
- incidence matrix
- information matrix
- instrumental variables matrix
- inverse matrix
- invertible matrix
- Jacobian matrix
- key matrix
- learning matrix
- loop-impedance matrix
- matrix of full rank
- matrix of strategies
- matrix of weighted connections
- memory matrix
- microwave switching matrix
- multiple-beam-forming matrix
- n-diagonal matrix
- negative definite matrix
- negative semidefinite matrix
- nonsingular matrix
- null matrix
- orthogonal matrix
- orthonormal matrix
- outcome matrix
- parity-check matrix
- partitioned matrix
- passive matrix
- permeability matrix
- permittivity matrix
- permutation matrix
- polarization matrix
- polarization scattering matrix
- polynomial matrix
- positive definite matrix
- positive semidefinite matrix
- power scattering matrix
- projection matrix
- pseudoinverse matrix
- radar cross-section matrix
- radar scattering matrix
- reciprocal matrix
- rectangular matrix
- reflecting matrix
- regression matrix
- resistivity matrix
- resolvent matrix
- scattering matrix with absolute phase
- scattering matrix with relative phase
- scattering matrix
- scrambling matrix
- selection matrix
- shift matrix
- signal matrix
- singular matrix
- sparse matrix
- spectral matrix
- spurless matrix
- square matrix
- state matrix
- stochastic matrix
- storage matrix
- switching matrix
- symmetric matrix
- symmetry matrix
- systolic matrix
- target-scattering matrix
- thermally-addressed matrix
- thinned matrix
- topological matrix
- traceless matrix
- traffic matrix
- traffic requirement matrix
- transformation matrix
- transformer-diode matrix
- transition matrix
- transition probability matrix
- transmission matrix
- transposed matrix
- triangular matrix
- two-dimensional matrix
- U-matrix
- unit matrix
- unitary matrix
- variance-covariance matrix
- weight matrix
- x-y matrix
- Y matrix
- Z matrixThe New English-Russian Dictionary of Radio-electronics > matrix
См. также в других словарях:
Sparse binary polynomial hashing — (SBPH) is a generalization of Bayesian filtering that can match mutating phrases as well as single words. SBPH is a way of generating a large number of features from an incoming text automatically, and then using statistics to determine the… … Wikipedia
Sparse language — In computational complexity theory, a sparse language is a formal language (a set of strings) such that the number of strings of length n in the language is bounded by a polynomial function of n . They are used primarily in the study of the… … Wikipedia
Tutte polynomial — This article is about the Tutte polynomial of a graph. For the Tutte polynomial of a matroid, see Matroid. The polynomial x4 + x3 + x2y is the Tutte polynomial of the Bull graph. The red line shows the intersection with the plane … Wikipedia
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… … Wikipedia
Finite element method — The finite element method (FEM) (sometimes referred to as finite element analysis) is a numerical technique for finding approximate solutions of partial differential equations (PDE) as well as of integral equations. The solution approach is based … Wikipedia
P/poly — In computational complexity theory, P/poly is the complexity class of languages recognized by a polynomial time Turing machine with a polynomial bounded advice function. It is also (equivalently) defined as the class of languages that have a… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
P (complexity) — In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is one of the most fundamental complexity classes. It contains all decision problems which can be solved by a deterministic Turing machine using a polynomial amount of… … Wikipedia
